CB-Pattern Trees : Identifying Distributed Nodes Where Materialization is Available
نویسندگان
چکیده
منابع مشابه
Distributed Highly Available Search Trees
We propose a distributed dictionary that tolerates arbitrary single server crashes. The distinctive feature of our model is that the crash of a server cannot be detected. This is in contrast to all other proposals of distributed fault tolerant search structures presented thus far. It reflects the real situation in the internet more accurately, and is in general more suitable to complex overall ...
متن کاملM Aterialization Is a Vailable
The role of materialized views is becoming vital in today’s distributed Data warehouses. Materialization is where parts of the data cube are pre-computed. Some of the real time distributed architectures are maintaining materialization transparencies in the sense the users are not known with the materialization at a node. Usually what all followed by them is a cache maintenance mechanism where t...
متن کاملMaterialization: A Powerful and Ubiquitous Abstraction Pattern
Materialization is a useful abstraction pattern that can be identified in many application settings. Intuitively, materialization is the relationship between a class of categories (e.g., models of cars) and a class of more concrete objects (e.g., individual cars). This paper gives a quasi-formal semantic definition of materialization in terms of the usual is-a and isof abstractions, and of a cl...
متن کاملDistributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks
We address the problem of building and maintaining a forest of spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we strive to preserve some properties such as cycle-freeness or existence of a unique root in each fragment regardless of the events, so as to keep these fragme...
متن کاملRe-identifying Anonymous Nodes
In mobile scenarios, privacy is an aspect of growing importance. In order to avoid the creation of movement profiles, participating nodes change their identifying properties on a regular basis in order to hide their identities and stay anonymous. The drawback of this action is that nodes which previously had a connection have no means to recognise this fact. A complete re-authentication would b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Mining & Knowledge Management Process
سال: 2016
ISSN: 2231-007X,2230-9608
DOI: 10.5121/ijdkp.2016.6102